Tight Bounds for Blind Search on the Integers and the Reals
نویسندگان
چکیده
1Fakultät für Informatik und Automatisierung, Technische Universität Ilmenau, 98684 Ilmenau, Germany (e-mail: [email protected]) 2School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK (email: [email protected]) 3Fakultät für Informatik, Technische Universität Dortmund, 44221 Dortmund, Germany 4Department of Computer Science, University of Calgary, Calgary, Alberta T2N 1N4, Canada (email: [email protected])
منابع مشابه
Upper bounds on the solutions to n = p+m^2
ardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{R}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Tight Bounds for Blind Search on the Integers
We analyze a simple random process in which a token is moved in the interval A = [0, n]: Fix a probability distribution µ over [1, n]. Initially, the token is placed in a random position in A. In round t, a random value d is chosen according to µ. If the token is in position a ≥ d, then it is moved to position a−d. Otherwise it stays put. Let T be the number of rounds until the token reaches po...
متن کاملTight Bounds for Blind Search on the Integers
We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution μ over {1, . . . , n}. Initially, the token is placed in a random position in A. In round t, a random value d is chosen according to μ. If the token is in position a ≥ d, then it is moved to position a − d. Otherwise it stays put. Let T be the number of rounds until th...
متن کاملSums and Products along Sparse Graphs
In their seminal paper from 1983, Erdős and Szemerédi showed that any n distinct integers induce either n distinct sums of pairs or that many distinct products, and conjectured a lower bound of n2−o(1). They further proposed a generalization of this problem, in which the sums and products are taken along the edges of a given graph G on n labeled vertices. They conjectured a version of the sum-p...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 19 شماره
صفحات -
تاریخ انتشار 2010